Stirling Numbers of Forests and Cycles

For a graph G and a positive integer k, the graphical Stirling number S(G, k) is the number of partitions of the vertex set of G into k non-empty independent sets. Equivalently it is the number of proper colorings of G that use exactly k colors, with two colorings identified if they differ only on the names of the colors. If G is the empty graph on n vertices then S(G, k) reduces to S(n, k), the familiar Stirling number of the second kind. In this note we first consider Stirling numbers of forests. We show that if (F c(n) n )n≥0 is any sequence of forests with F c(n) n having n vertices and c(n) = o( √ n/ log n) components, and if X c(n) n is a random variable that takes value k with probability proportional to S(F c(n) n , k) (that is, X c(n) n is the number of classes in a uniformly chosen partition of F c(n) n into non-empty independent sets), then X c(n) n is asymptotically normal, meaning that suitably normalized it tends in distribution to the standard normal. This generalizes a seminal result of Harper on the ordinary Stirling numbers. Along the way we give recurrences for calculating the generating functions of the sequences (S(F c n, k))k≥0, show that these functions have all real zeroes, and exhibit three different interlacing patterns between the zeroes of pairs of consecutive generating functions. We next consider Stirling numbers of cycles. We establish asymptotic normality for the number of classes in a uniformly chosen partition of Cn (the cycle on n vertices) into non-empty independent sets. We give a recurrence for calculating the generating function of the sequence (S(Cn, k))k≥0, and use this to give a direct proof of a log-concavity result that had previously only been arrived at in a very indirect way. ∗[email protected]; Department of Mathematics, University of Notre Dame, Notre Dame IN 46556. Supported in part by National Security Agency grant H98230-10-1-0364. †[email protected]; University of Notre Dame, Notre Dame IN 46556. Supported by Glynn Family Honors Program.